def isprime(n):  # 判断素数函数
    for i in range(2, n):
        if n % i == 0:
            return 0
    return n


if __name__ == "__main__":
    N = int(input(""))
    prime_list = []
    tag = 0

    # 判断素数
    for i in range(2, N + 1):
        prime_list.append(isprime(i))

    if N % 2 != 0:
        print("Data error!")
    else:
        for p in prime_list:
            for q in prime_list:
                if N == p + q:
                    print(f"N = {p} + {q}")
                    tag = 1
                    break
            if tag == 1:
                break
